var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"filter\":\"tags:DelChan\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"M.\",\"Grossglauser\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT),Sorrento, Italy\",\"month\":\"June\",\"note\":\"\",\"pages\":\"52\",\"tags\":\"conf,DelChan,IT\",\"title\":\"Information transmission over a finite buffer channel\",\"year\":\"2000\",\"bibtex\":\"@inproceedings{DGj00,\\n author = {S N. Diggavi and M. Grossglauser,},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT),Sorrento, Italy},\\n month = {June},\\n note = {},\\n pages = {52},\\n tags = {conf,DelChan,IT},\\n title = {Information transmission over a finite buffer channel},\\n type = {4},\\n year = {2000}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"M. Grossglauser, undefined\"],\"key\":\"DGj00\",\"id\":\"DGj00\",\"bibbaseid\":\"diggavi-mgrossglauser-informationtransmissionoverafinitebufferchannel-2000\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper develops the best known (at the time of publication) capacity lower bounds to the deletion channel since the 1960s. It also makes a connection between deletion channels and the well studied problem of the length of the longest common subsequence. It shows that the capacity of the deletion channel for large alphabet size is close to the corresponding erasure channel, though the coding schemes for the two channels are drastically different.\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[],\"propositions\":[],\"lastnames\":[\"M.Grossglauser\"],\"suffixes\":[]}],\"booktitle\":\"Allerton Conference on Communication, Control, and Computing, Illinois\",\"file\":\":papers:ps:allerton01.pdf\",\"month\":\"October\",\"note\":\"\",\"pages\":\"\",\"tags\":\"conf,DelChan,IT,SelConf\",\"title\":\"On transmission over deletion channels\",\"year\":\"2001\",\"bibtex\":\"@inproceedings{DGj01,\\n abstract = {This paper develops the best known (at the time of publication) capacity lower\\nbounds to the deletion channel since the 1960s. It also makes a connection between deletion\\nchannels and the well studied problem of the length of the longest common subsequence.\\nIt shows that the capacity of the deletion channel for large alphabet size is close to the\\ncorresponding erasure channel, though the coding schemes for the two channels are \\ndrastically different.},\\n author = {S N. Diggavi and M.Grossglauser},\\n booktitle = {Allerton Conference on Communication, Control, and Computing, Illinois},\\n file = {:papers:ps:allerton01.pdf},\\n month = {October},\\n note = {},\\n pages = {},\\n tags = {conf,DelChan,IT,SelConf},\\n title = {On transmission over deletion channels},\\n type = {4},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"M.Grossglauser\"],\"key\":\"DGj01\",\"id\":\"DGj01\",\"bibbaseid\":\"diggavi-mgrossglauser-ontransmissionoverdeletionchannels-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Grossglauser\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Lausanne\",\"month\":\"June\",\"note\":\"\",\"pages\":\"421\",\"tags\":\"conf,DelChan,IT\",\"title\":\"Bounds on capacity of deletion channels\",\"year\":\"2002\",\"bibtex\":\"@inproceedings{DGj02,\\n author = {S N. Diggavi and M. Grossglauser},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Lausanne},\\n month = {June},\\n note = {},\\n pages = {421},\\n tags = {conf,DelChan,IT},\\n title = {Bounds on capacity of deletion channels},\\n type = {4},\\n year = {2002}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"Grossglauser, M.\"],\"key\":\"DGj02\",\"id\":\"DGj02\",\"bibbaseid\":\"diggavi-grossglauser-boundsoncapacityofdeletionchannels-2002\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper was motivated by the transmission of information over finite buffer channels. Analyzing the capacity of such channels naturally led us to the study of \\\\em deletion channels. In deletion channels, in contrast to erasure channels, symbols of the transmitted sequence are removed, and the receiver does \\\\em not know which symbols have been deleted. This was a classic problem from the 1960s in the context of modeling synchronization errors. This paper gave the best known (at the time of publication) lower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure process has memory, feedback does not increase the capacity.\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Grossglauser\"],\"suffixes\":[]}],\"file\":\":papers:ps:finbuf.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"dg_j06\",\"month\":\"March\",\"note\":\"\",\"number\":\"3\",\"pages\":\"1226–1237\",\"tags\":\"journal,DelChan,IT\",\"title\":\"Information transmission over a finite buffer channel\",\"volume\":\"52\",\"year\":\"2006\",\"bibtex\":\"@article{DGj06,\\n abstract = {This paper was motivated by the transmission of information over finite buffer\\nchannels. Analyzing the capacity of such channels naturally led us to the study of {\\\\em deletion} channels. In deletion channels, in contrast to erasure channels, symbols of the\\ntransmitted sequence are removed, and the receiver does {\\\\em not} know which symbols\\nhave been deleted. This was a classic problem from the 1960s in the context of modeling\\nsynchronization errors. This paper gave the best known (at the time of publication) \\nlower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure\\nprocess has memory, feedback does not increase the capacity.},\\n author = {S N. Diggavi and M. Grossglauser},\\n file = {:papers:ps:finbuf.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {dg_j06},\\n month = {March},\\n note = {},\\n number = {3},\\n pages = {1226--1237},\\n tags = {journal,DelChan,IT},\\n title = {Information transmission over a finite buffer channel},\\n type = {2},\\n volume = {52},\\n year = {2006}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"Grossglauser, M.\"],\"key\":\"DGj06\",\"id\":\"DGj06\",\"bibbaseid\":\"diggavi-grossglauser-informationtransmissionoverafinitebufferchannel-2006\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We present upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. We provide a general approach that gives a numerical answer for fixed d, and provide an argument that gives asymptotic upper bounds as d goes to 1. These appear to be the first non-trivial upper bounds for this probabilistic deletion channel.\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Mitzenmacher\"],\"suffixes\":[]},{\"firstnames\":[\"H\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Pfister\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Nice,France\",\"file\":\":papers:delubisit07.pdf\",\"month\":\"June\",\"note\":\"\",\"pages\":\"1716–1720\",\"tags\":\"conf,DelChan,IT,SelConf\",\"title\":\"Capacity upper bounds for the deletion channel\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{DMPj07,\\n abstract = {We present upper bounds on the capacity of the i.i.d.\\nbinary deletion channel, where each bit is independently deleted\\nwith a fixed probability d. We provide a general approach that\\ngives a numerical answer for fixed d, and provide an argument\\nthat gives asymptotic upper bounds as d goes to 1. These appear\\nto be the first non-trivial upper bounds for this probabilistic\\ndeletion channel.},\\n author = {S N. Diggavi and M. Mitzenmacher and H D. Pfister},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Nice,France},\\n file = {:papers:delubisit07.pdf},\\n month = {June},\\n note = {},\\n pages = {1716--1720},\\n tags = {conf,DelChan,IT,SelConf},\\n title = {Capacity upper bounds for the deletion channel},\\n type = {4},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"Mitzenmacher, M.\",\"Pfister, H D.\"],\"key\":\"DMPj07\",\"id\":\"DMPj07\",\"bibbaseid\":\"diggavi-mitzenmacher-pfister-capacityupperboundsforthedeletionchannel-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publicactions_v1.bib\" href=\"data:text/bibtex;base64,QGlucHJvY2VlZGluZ3N7REdqMDAsCiBhdXRob3IgPSB7UyBOLiBEaWdnYXZpIGFuZCBNLiBHcm9zc2dsYXVzZXIsfSwKIGJvb2t0aXRsZSA9IHtJRUVFIEludGVybmF0aW9uYWwgU3ltcG9zaXVtIG9uIEluZm9ybWF0aW9uIFRoZW9yeSAoSVNJVCksU29ycmVudG8sIEl0YWx5fSwKIG1vbnRoID0ge0p1bmV9LAogbm90ZSA9IHt9LAogcGFnZXMgPSB7NTJ9LAogdGFncyA9IHtjb25mLERlbENoYW4sSVR9LAogdGl0bGUgPSB7SW5mb3JtYXRpb24gdHJhbnNtaXNzaW9uIG92ZXIgYSBmaW5pdGUgYnVmZmVyIGNoYW5uZWx9LAogdHlwZSA9IHs0fSwKIHllYXIgPSB7MjAwMH0KfQoKCgpAaW5wcm9jZWVkaW5nc3tER2owMSwKIGFic3RyYWN0ID0ge1RoaXMgcGFwZXIgZGV2ZWxvcHMgdGhlIGJlc3Qga25vd24gKGF0IHRoZSB0aW1lIG9mIHB1YmxpY2F0aW9uKSBjYXBhY2l0eSBsb3dlcgpib3VuZHMgdG8gdGhlIGRlbGV0aW9uIGNoYW5uZWwgc2luY2UgdGhlIDE5NjBzLiBJdCBhbHNvIG1ha2VzIGEgY29ubmVjdGlvbiBiZXR3ZWVuIGRlbGV0aW9uCmNoYW5uZWxzIGFuZCB0aGUgd2VsbCBzdHVkaWVkIHByb2JsZW0gb2YgdGhlIGxlbmd0aCBvZiB0aGUgbG9uZ2VzdCBjb21tb24gc3Vic2VxdWVuY2UuCkl0IHNob3dzIHRoYXQgdGhlIGNhcGFjaXR5IG9mIHRoZSBkZWxldGlvbiBjaGFubmVsIGZvciBsYXJnZSBhbHBoYWJldCBzaXplIGlzIGNsb3NlIHRvIHRoZQpjb3JyZXNwb25kaW5nIGVyYXN1cmUgY2hhbm5lbCwgdGhvdWdoIHRoZSBjb2Rpbmcgc2NoZW1lcyBmb3IgdGhlIHR3byBjaGFubmVscyBhcmUgCmRyYXN0aWNhbGx5IGRpZmZlcmVudC59LAogYXV0aG9yID0ge1MgTi4gRGlnZ2F2aSBhbmQgTS5Hcm9zc2dsYXVzZXJ9LAogYm9va3RpdGxlID0ge0FsbGVydG9uIENvbmZlcmVuY2Ugb24gQ29tbXVuaWNhdGlvbiwgQ29udHJvbCwgYW5kIENvbXB1dGluZywgSWxsaW5vaXN9LAogZmlsZSA9IHs6cGFwZXJzOnBzOmFsbGVydG9uMDEucGRmfSwKIG1vbnRoID0ge09jdG9iZXJ9LAogbm90ZSA9IHt9LAogcGFnZXMgPSB7fSwKIHRhZ3MgPSB7Y29uZixEZWxDaGFuLElULFNlbENvbmZ9LAogdGl0bGUgPSB7T24gdHJhbnNtaXNzaW9uIG92ZXIgZGVsZXRpb24gY2hhbm5lbHN9LAogdHlwZSA9IHs0fSwKIHllYXIgPSB7MjAwMX0KfQoKCgpAaW5wcm9jZWVkaW5nc3tER2owMiwKIGF1dGhvciA9IHtTIE4uIERpZ2dhdmkgYW5kIE0uIEdyb3NzZ2xhdXNlcn0sCiBib29rdGl0bGUgPSB7SUVFRSBJbnRlcm5hdGlvbmFsIFN5bXBvc2l1bSBvbiBJbmZvcm1hdGlvbiBUaGVvcnkgKElTSVQpLCBMYXVzYW5uZX0sCiBtb250aCA9IHtKdW5lfSwKIG5vdGUgPSB7fSwKIHBhZ2VzID0gezQyMX0sCiB0YWdzID0ge2NvbmYsRGVsQ2hhbixJVH0sCiB0aXRsZSA9IHtCb3VuZHMgb24gY2FwYWNpdHkgb2YgZGVsZXRpb24gY2hhbm5lbHN9LAogdHlwZSA9IHs0fSwKIHllYXIgPSB7MjAwMn0KfQoKCgpAYXJ0aWNsZXtER2owNiwKIGFic3RyYWN0ID0ge1RoaXMgcGFwZXIgd2FzIG1vdGl2YXRlZCBieSB0aGUgdHJhbnNtaXNzaW9uIG9mIGluZm9ybWF0aW9uIG92ZXIgZmluaXRlIGJ1ZmZlcgpjaGFubmVscy4gQW5hbHl6aW5nIHRoZSBjYXBhY2l0eSBvZiBzdWNoIGNoYW5uZWxzIG5hdHVyYWxseSBsZWQgdXMgdG8gdGhlIHN0dWR5IG9mIHtcZW0gZGVsZXRpb259IGNoYW5uZWxzLiBJbiBkZWxldGlvbiBjaGFubmVscywgaW4gY29udHJhc3QgdG8gZXJhc3VyZSBjaGFubmVscywgc3ltYm9scyBvZiB0aGUKdHJhbnNtaXR0ZWQgc2VxdWVuY2UgYXJlIHJlbW92ZWQsIGFuZCB0aGUgcmVjZWl2ZXIgZG9lcyB7XGVtIG5vdH0ga25vdyB3aGljaCBzeW1ib2xzCmhhdmUgYmVlbiBkZWxldGVkLiBUaGlzIHdhcyBhIGNsYXNzaWMgcHJvYmxlbSBmcm9tIHRoZSAxOTYwcyBpbiB0aGUgY29udGV4dCBvZiBtb2RlbGluZwpzeW5jaHJvbml6YXRpb24gZXJyb3JzLiBUaGlzIHBhcGVyIGdhdmUgdGhlIGJlc3Qga25vd24gKGF0IHRoZSB0aW1lIG9mIHB1YmxpY2F0aW9uKSAKbG93ZXIgYm91bmRzIHRvIGNhcGFjaXR5IG9mIGRlbGV0aW9uIGNoYW5uZWxzIHNpbmNlIHRoZSAxOTYwcy4gSXQgYWxzbyBzdHVkaWVkIGVyYXN1cmUgY2hhbm5lbHMgd2l0aCBhcmJpdHJhcnkgbWVtb3J5IGluIHRoZSBlcmFzdXJlIHByb2Nlc3MuIEl0IHNob3dlZCB0aGF0IGV2ZW4gd2hlbiB0aGUgZXJhc3VyZQpwcm9jZXNzIGhhcyBtZW1vcnksIGZlZWRiYWNrIGRvZXMgbm90IGluY3JlYXNlIHRoZSBjYXBhY2l0eS59LAogYXV0aG9yID0ge1MgTi4gRGlnZ2F2aSBhbmQgTS4gR3Jvc3NnbGF1c2VyfSwKIGZpbGUgPSB7OnBhcGVyczpwczpmaW5idWYucGRmfSwKIGpvdXJuYWwgPSB7SUVFRSBUcmFuc2FjdGlvbnMgb24gSW5mb3JtYXRpb24gVGhlb3J5fSwKIGxhYmVsID0ge2RnX2owNn0sCiBtb250aCA9IHtNYXJjaH0sCiBub3RlID0ge30sCiBudW1iZXIgPSB7M30sCiBwYWdlcyA9IHsxMjI2LS0xMjM3fSwKIHRhZ3MgPSB7am91cm5hbCxEZWxDaGFuLElUfSwKIHRpdGxlID0ge0luZm9ybWF0aW9uIHRyYW5zbWlzc2lvbiBvdmVyIGEgZmluaXRlIGJ1ZmZlciBjaGFubmVsfSwKIHR5cGUgPSB7Mn0sCiB2b2x1bWUgPSB7NTJ9LAogeWVhciA9IHsyMDA2fQp9CgoKCkBpbnByb2NlZWRpbmdze0RNUGowNywKIGFic3RyYWN0ID0ge1dlIHByZXNlbnQgdXBwZXIgYm91bmRzIG9uIHRoZSBjYXBhY2l0eSBvZiB0aGUgaS5pLmQuCmJpbmFyeSBkZWxldGlvbiBjaGFubmVsLCB3aGVyZSBlYWNoIGJpdCBpcyBpbmRlcGVuZGVudGx5IGRlbGV0ZWQKd2l0aCBhIGZpeGVkIHByb2JhYmlsaXR5IGQuIFdlIHByb3ZpZGUgYSBnZW5lcmFsIGFwcHJvYWNoIHRoYXQKZ2l2ZXMgYSBudW1lcmljYWwgYW5zd2VyIGZvciBmaXhlZCBkLCBhbmQgcHJvdmlkZSBhbiBhcmd1bWVudAp0aGF0IGdpdmVzIGFzeW1wdG90aWMgdXBwZXIgYm91bmRzIGFzIGQgZ29lcyB0byAxLiBUaGVzZSBhcHBlYXIKdG8gYmUgdGhlIGZpcnN0IG5vbi10cml2aWFsIHVwcGVyIGJvdW5kcyBmb3IgdGhpcyBwcm9iYWJpbGlzdGljCmRlbGV0aW9uIGNoYW5uZWwufSwKIGF1dGhvciA9IHtTIE4uIERpZ2dhdmkgYW5kIE0uIE1pdHplbm1hY2hlciBhbmQgSCBELiBQZmlzdGVyfSwKIGJvb2t0aXRsZSA9IHtJRUVFIEludGVybmF0aW9uYWwgU3ltcG9zaXVtIG9uIEluZm9ybWF0aW9uIFRoZW9yeSAoSVNJVCksIE5pY2UsRnJhbmNlfSwKIGZpbGUgPSB7OnBhcGVyczpkZWx1YmlzaXQwNy5wZGZ9LAogbW9udGggPSB7SnVuZX0sCiBub3RlID0ge30sCiBwYWdlcyA9IHsxNzE2LS0xNzIwfSwKIHRhZ3MgPSB7Y29uZixEZWxDaGFuLElULFNlbENvbmZ9LAogdGl0bGUgPSB7Q2FwYWNpdHkgdXBwZXIgYm91bmRzIGZvciB0aGUgZGVsZXRpb24gY2hhbm5lbH0sCiB0eXBlID0gezR9LAogeWVhciA9IHsyMDA3fQp9Cgo=\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:DelChan&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:DelChan&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:DelChan&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"diggavi-mitzenmacher-pfister-capacityupperboundsforthedeletionchannel-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  M. Mitzenmacher;  and  H D. Pfister.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Capacity upper bounds for the deletion channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Nice,France</i>, pages 1716–1720, June 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-mitzenmacher-pfister-capacityupperboundsforthedeletionchannel-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-mitzenmacher-pfister-capacityupperboundsforthedeletionchannel-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DMPj07,\n abstract = {We present upper bounds on the capacity of the i.i.d.\nbinary deletion channel, where each bit is independently deleted\nwith a fixed probability d. We provide a general approach that\ngives a numerical answer for fixed d, and provide an argument\nthat gives asymptotic upper bounds as d goes to 1. These appear\nto be the first non-trivial upper bounds for this probabilistic\ndeletion channel.},\n author = {S N. Diggavi and M. Mitzenmacher and H D. Pfister},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Nice,France},\n file = {:papers:delubisit07.pdf},\n month = {June},\n note = {},\n pages = {1716--1720},\n tags = {conf,DelChan,IT,SelConf},\n title = {Capacity upper bounds for the deletion channel},\n type = {4},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. We provide a general approach that gives a numerical answer for fixed d, and provide an argument that gives asymptotic upper bounds as d goes to 1. These appear to be the first non-trivial upper bounds for this probabilistic deletion channel.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2006\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2006')\"\n      onkeypress=\"toggleGroup('group_2006')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2006</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"diggavi-grossglauser-informationtransmissionoverafinitebufferchannel-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  and  M. Grossglauser.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Information transmission over a finite buffer channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 52(3): 1226–1237. March 2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-grossglauser-informationtransmissionoverafinitebufferchannel-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-grossglauser-informationtransmissionoverafinitebufferchannel-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DGj06,\n abstract = {This paper was motivated by the transmission of information over finite buffer\nchannels. Analyzing the capacity of such channels naturally led us to the study of {\\em deletion} channels. In deletion channels, in contrast to erasure channels, symbols of the\ntransmitted sequence are removed, and the receiver does {\\em not} know which symbols\nhave been deleted. This was a classic problem from the 1960s in the context of modeling\nsynchronization errors. This paper gave the best known (at the time of publication) \nlower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure\nprocess has memory, feedback does not increase the capacity.},\n author = {S N. Diggavi and M. Grossglauser},\n file = {:papers:ps:finbuf.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {dg_j06},\n month = {March},\n note = {},\n number = {3},\n pages = {1226--1237},\n tags = {journal,DelChan,IT},\n title = {Information transmission over a finite buffer channel},\n type = {2},\n volume = {52},\n year = {2006}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper was motivated by the transmission of information over finite buffer channels. Analyzing the capacity of such channels naturally led us to the study of \\em deletion channels. In deletion channels, in contrast to erasure channels, symbols of the transmitted sequence are removed, and the receiver does \\em not know which symbols have been deleted. This was a classic problem from the 1960s in the context of modeling synchronization errors. This paper gave the best known (at the time of publication) lower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure process has memory, feedback does not increase the capacity.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2002\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2002')\"\n      onkeypress=\"toggleGroup('group_2002')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2002</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"diggavi-grossglauser-boundsoncapacityofdeletionchannels-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  and  M. Grossglauser.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Bounds on capacity of deletion channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Lausanne</i>, pages 421, June 2002. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-grossglauser-boundsoncapacityofdeletionchannels-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-grossglauser-boundsoncapacityofdeletionchannels-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DGj02,\n author = {S N. Diggavi and M. Grossglauser},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Lausanne},\n month = {June},\n note = {},\n pages = {421},\n tags = {conf,DelChan,IT},\n title = {Bounds on capacity of deletion channels},\n type = {4},\n year = {2002}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2001\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2001')\"\n      onkeypress=\"toggleGroup('group_2001')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2001</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"diggavi-mgrossglauser-ontransmissionoverdeletionchannels-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  and  M.Grossglauser.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On transmission over deletion channels.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Allerton Conference on Communication, Control, and Computing, Illinois</i>, October 2001. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-mgrossglauser-ontransmissionoverdeletionchannels-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-mgrossglauser-ontransmissionoverdeletionchannels-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DGj01,\n abstract = {This paper develops the best known (at the time of publication) capacity lower\nbounds to the deletion channel since the 1960s. It also makes a connection between deletion\nchannels and the well studied problem of the length of the longest common subsequence.\nIt shows that the capacity of the deletion channel for large alphabet size is close to the\ncorresponding erasure channel, though the coding schemes for the two channels are \ndrastically different.},\n author = {S N. Diggavi and M.Grossglauser},\n booktitle = {Allerton Conference on Communication, Control, and Computing, Illinois},\n file = {:papers:ps:allerton01.pdf},\n month = {October},\n note = {},\n pages = {},\n tags = {conf,DelChan,IT,SelConf},\n title = {On transmission over deletion channels},\n type = {4},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper develops the best known (at the time of publication) capacity lower bounds to the deletion channel since the 1960s. It also makes a connection between deletion channels and the well studied problem of the length of the longest common subsequence. It shows that the capacity of the deletion channel for large alphabet size is close to the corresponding erasure channel, though the coding schemes for the two channels are drastically different.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2000\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2000')\"\n      onkeypress=\"toggleGroup('group_2000')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2000</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"diggavi-mgrossglauser-informationtransmissionoverafinitebufferchannel-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  and   M. Grossglauser.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Information transmission over a finite buffer channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT),Sorrento, Italy</i>, pages 52, June 2000. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-mgrossglauser-informationtransmissionoverafinitebufferchannel-2000\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-mgrossglauser-informationtransmissionoverafinitebufferchannel-2000')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DGj00,\n author = {S N. Diggavi and M. Grossglauser,},\n booktitle = {IEEE International Symposium on Information Theory (ISIT),Sorrento, Italy},\n month = {June},\n note = {},\n pages = {52},\n tags = {conf,DelChan,IT},\n title = {Information transmission over a finite buffer channel},\n type = {4},\n year = {2000}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);